USING A SET PACKING FORMULATION TO SOLVE AIRLINE SEAT ALLOCATION/REALLOCATION PROBLEMS
نویسندگان
چکیده
منابع مشابه
A Distributed Multi-Agent System to Solve Airline Operations Problems
An airline schedule very rarely operates as planned. Problems related with aircrafts, crew members and passengers are common and the actions towards the solution of these problems are usually known as operations recovery or disruption management. The Airline Operations Control Center (AOCC) tries to solve these problems with the minimum impact in the airline schedule, with the minimum cost and,...
متن کاملUsing MOLP based procedures to solve DEA problems
Data envelopment analysis (DEA) is a technique used to evaluate the relative efficiency of comparable decision making units (DMUs) with multiple input-output. It computes a scalar measure of efficiency and discriminates between efficient and inefficient DMUs. It can also provide reference units for inefficient DMUs without consideration of the decision makers’ (DMs) preferences. In this paper, ...
متن کاملCollaboration Between Hyperheuristics to Solve Strip-Packing Problems
In this paper we introduce a collaboration framework for hyperheuristics to solve hard strip packing problems. We have designed a genetic based hyperheuristic to cooperate with a hill-climbing based hyperheuristic. Both of them use the most recently proposed low-level heuristics in the literature. REVAC, which has recently been proposed for tuning [18], has been used to find the best operators ...
متن کاملAn Evolutionary Hyperheuristic to Solve Strip-Packing Problems
In this paper we introduce an evolutionary hyperheuristic approach to solve difficult strip packing problems. We have designed a genetic based hyperheuristic using the most recently proposed low-level heuristics in the literature. Two versions for tuning parameters have also been evaluated. The results obtained are very encouraging showing that our approach outperforms the single heuristics and...
متن کاملGRASP for set packing problems
The principles of the Greedy Randomized Adaptative Search Procedure (GRASP) metaheuristic are instantiated for the set packing problem. We investigated several construction phases, and evaluated improvements based on advanced strategies. These improvements include a self-tuning procedure (using reactive GRASP), an intensification procedure (using path relinking) and a procedure involving the di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1999
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.42.32